package LeetCode.LeetCodeHot;

/**
 * 只出现一次的数字
 * @author lumin
 * @date 2022/03/23 13:09
 **/
public class Num136 {
    public int singleNumber(int[] nums) {
        int num = 0;
        for (int i = 0; i < nums.length; i++) {
            num = num ^ nums[i];
        }
        return num;
    }
}